Degree-bounded minimum spanning tree for unit disk graph
نویسندگان
چکیده
منابع مشابه
Degree-bounded minimum spanning trees
* to be exact, times the weight of a minimum spanning tree (MST). In particular, we present an improved analysis of Chan’s degree-4 MST algorithm [4]. Previous results. Arora [1] and Mitchell [9] presented PTASs for TSP in Euclidean metric, for fixed dimensions. Unfortunately, neither algorithm extends to find degree-3 or degree-4 trees. Recently, Arora and Chang [3] have devised a quasi-polyno...
متن کاملProbabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem
In the b-degree constrained Euclidean minimum spanning tree problem (bMST) we are given n points in [0; 1] and a degree constraint b 2. The aim is to nd a minimum weight spanning tree in which each vertex has degree at most b. In this paper we analyze the probabilistic version of the problem and prove in a rmative the conjecture of Yukich stated in 1998 on the asymptotics of the problem for uni...
متن کاملMatroidal degree-bounded minimum spanning trees
We consider the minimum spanning tree (MST) problem under the restriction that for every vertex v, the edges of the tree that are adjacent to v satisfy a given family of constraints. A famous example thereof is the classical degree-bounded MST problem, where for every vertex v, a simple upper bound on the degree is imposed. Iterative rounding/relaxation algorithms became the tool of choice for ...
متن کاملThe Directed Minimum-Degree Spanning Tree Problem
Consider a directed graph G = (V,E) with n vertices and a root vertex r ∈ V . The DMDST problem for G is one of constructing a spanning tree rooted at r, whose maximal degree is the smallest among all such spanning trees. The problem is known to be NP-hard. A quasipolynomial time approximation algorithm for this problem is presented. The algorithm finds a spanning tree whose maximal degree is a...
متن کاملThe non-uniform Bounded Degree Minimum Diameter Spanning Tree problem with an application in P2P networking
This paper considers the Bounded Degree Minimum Diameter Spanning Tree problem (BDST problem) with non-uniform degree bounds. In this problem, we are given a metric length function ` over a set V of n nodes and a degree bound Bv for each v ∈ V , and want to find a spanning tree with minimum diameter such that each node v has degree at most Bv. We present a simple extension of an O( √ log n)-app...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2012
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.10.019